By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 27, Issue 6, pp. 1515-1811

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Learning Read-k-Satisfy-j DNF

Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, and Dan Roth

pp. 1515-1530

Log-Space Polynomial End-to-End Communication

Eyal Kushilevitz, Rafail Ostrovsky, and Adi Rosén

pp. 1531-1549

Lower Bounds for Randomized Mutual Exclusion

Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, and David Zuckerman

pp. 1550-1563

Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost

Tony W. Lai and Derick Wood

pp. 1564-1591

Tree Contractions and Evolutionary Trees

Ming-Yang Kao

pp. 1592-1616

Optimal Prediction for Prefetching in the Worst Case

P. Krishnan and Jeffrey Scott Vitter

pp. 1617-1636

A Correctness Condition for High-Performance Multiprocessors

Hagit Attiya and Roy Friedman

pp. 1637-1670

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

Maw-Shang Chang

pp. 1671-1694

Computing the Local Consensus of Trees

Sampath Kannan, Tandy Warnow, and Shibu Yooseph

pp. 1695-1724

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

Hans L. Bodlaender and Torben Hagerup

pp. 1725-1746

First-Order Queries on Finite Structures Over the Reals

Jan Paredaens, Jan Van den Bussche, and Dirk Van Gucht

pp. 1747-1763

Spirality and Optimal Orthogonal Drawings

Giuseppe Di Battista, Giuseppe Liotta, and Francesco Vargiu

pp. 1764-1811